DNA Computing and its Application
نویسنده
چکیده
The objectives of this chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context of solving NP-complete/NP-hard problems that are the most difficult problems in NP, but also implementation by way of digital (silicon-based) computers [21]. We commence with a description of the basic concepts of ‘wet computation’, then present recent results for the efficient management of a group of elevators.
منابع مشابه
Fault Tolerant DNA Computing Based on Digital Microfluidic Biochips
Historically, DNA molecules have been known as the building blocks of life, later on in 1994, Leonard Adelman introduced a technique to utilize DNA molecules for a new kind of computation. According to the massive parallelism, huge storage capacity and the ability of using the DNA molecules inside the living tissue, this type of computation is applied in many application areas such as me...
متن کاملCloud Computing Application and Its Advantages and Difficulties in the Teaching Process
The objective of this research is to identify the technology of cloud computing in terms of its concept, its development, its objectives, its components, models, classifications, and the advantages of its use in the teaching process at the University of Samarra, as well as to identify the most important challenges and obstacles that teachers face in using University of Samarra. The researcher u...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA Compromise Ratio Ranking Method of Triangular Intuitionistic Fuzzy Numbers\ and Its Application to MADM Problems
Triangular intuitionistic fuzzy numbers (TIFNs) is a special case of intuitionistic fuzzy (IF) set and the ranking of TIFNs is an important problem. The aim of this paper is to develop a new methodology for ranking TIFNs by using multiattribute decision making methods (MADM). In this methodology, the value and ambiguity indices of TIFNs may be considered as the attributes and the TIFNs in compa...
متن کاملReview on Graphene FET and its Application in Biosensing
Graphene, after its first production in 2004 have received lots of attentions from researchers because of its unique properties. High mobility, high sensitivity, high selectivity and high surface area make graphene excellent choice for bio application. One of promising graphene base device that has amazingly high sensitivity is graphene field-effect transistor (GFET). This review selectively su...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کامل